Generic Validation of Structural Content with Parametric Modules

In this paper, we demonstrate a natural mapping from element types of XML to module expressions of ML-like programming languages. The mapping is inductive, and the definitions of common XML operations can be derived as the module expressions are constructed. We show how to derive, in a generic way, the validation function, which checks an XML document for conformance to the content model specified by its DTD (Document Type Definition). One can view the validation function as giving types to XML elements, and the validation procedure a pre-requirement for typeful XML programming in ML

A Randomized Implementation of Multiple Functional Arrays

The array update problem in the implementation of a purely functional language is the following: once an array is updated, both the original array and the newly updated one must be preserved to maintain referential transparency. Previous approaches have mainly based on the detection or enforcement of single--threaded accesses to an aggregate, by means of compiler--time analyses or language restrictions. These approaches cannot deal with aggregates which are updated in a multi--threaded manner. Baker's shallow binding scheme can be used to implement multi--threaded functional arrays. His scheme, however, can be very expensive if there are repeated alternations between long binding paths. We design a scheme that fragments binding paths randomly. The randomization scheme is on--line, simple to implement, and its expected performance comparable to that of the optimal off--line solutions. All this is achieved without using compiler--time analyses, and without restricting the languages. The ..

A syntactic approach to fixed point computation on finite domains

[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;有審查制度;具代表